Method and system for improving compressed image chroma information

ABSTRACT

Methods, systems, and computer programs for improving compressed image chroma information. In one aspect of the invention, a resolution for a red color component of a color video image is used that is higher than the resolution for a blue color component of the color video image. Another aspect includes utilizing a lower or higher value of a quantization parameter (QP) for one or more chroma channels as compared to the luminance channel. Another aspect is use of a logarithmic representation of a video image to benefit image coding. Another aspect uses more than two chroma channels to represent a video image.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a divisional of and claims priority to U.S.application Ser. No. 12/913,045, filed on Oct. 27, 2010, which is adivisional of and claims priority to U.S. application Ser. No.12/176,267, filed on Jul. 18, 2008, now U.S. Pat. No. 7,961,784, whichis a divisional of and claims priority to U.S. application Ser. No.09/905,039, filed on Jul. 12, 2001, now abandoned. The disclosures ofthese applications are incorporated by reference in their entirety.

TECHNICAL FIELD

This invention relates to video compression, and more particularly tomethods, systems, and computer programs for improving compressed imagechroma information in MPEG-like video compression systems.

BACKGROUND

MPEG Background

MPEG-2 and MPEG-4 are international video compression standards defininga video syntax that provides an efficient way to represent imagesequences in the form of more compact coded data. The language of thecoded bits is the “syntax.” For example, a few tokens can represent anentire block of samples (e.g., 64 samples for MPEG-2). Both MPEGstandards also describe a decoding (reconstruction) process where thecoded bits are mapped from the compact representation into anapproximation of the original format of the image sequence. For example,a flag in the coded bitstream signals whether the following bits are tobe preceded with a prediction algorithm prior to being decoded with adiscrete cosine transform (DCT) algorithm. The algorithms comprising thedecoding process are regulated by the semantics defined by these MPEGstandards. This syntax can be applied to exploit common videocharacteristics such as spatial redundancy, temporal redundancy, uniformmotion, spatial masking, etc. In effect, these MPEG standards define aprogramming language as well as a data format. An MPEG decoder must beable to parse and decode an incoming data stream, but so long as thedata stream complies with the corresponding MPEG syntax, a wide varietyof possible data structures and compression techniques can be used(although technically this deviates from the standard since thesemantics are not conformant). It is also possible to carry the neededsemantics within an alternative syntax.

These MPEG standards use a variety of compression methods, includingintraframe and interframe methods. In most video scenes, the backgroundremains relatively stable while action takes place in the foreground.The background may move, but a great deal of the scene is redundant.These MPEG standards start compression by creating a reference framecalled an “intra” frame or “I frame”. I frames are compressed withoutreference to other frames and thus contain an entire frame of videoinformation. I frames provide entry points into a data bitstream forrandom access, but can only be moderately compressed. Typically, thedata representing I frames is placed in the bitstream every 12 to 15frames (although it is also useful in some circumstances to use muchwider spacing between I frames). Thereafter, since only a small portionof the frames that fall between the reference I frames are differentfrom the bracketing I frames, only the image differences are captured,compressed, and stored. Two types of frames are used for suchdifferences—predicted or P frames, and bi-directional interpolated or Bframes.

P frames generally are encoded with reference to a past frame (either anI frame or a previous P frame), and, in general, are used as a referencefor subsequent P frames. P frames receive a fairly high amount ofcompression. B frames provide the highest amount of compression butrequire both a past and a future reference frame in order to be encoded.Bi-directional frames are never used for reference frames in standardcompression technologies.

Macroblocks are regions of image pixels. For MPEG-2, a macroblock is a16×16 pixel grouping of four 8×8 DCT blocks, together with one motionvector for P frames, and one or two motion vectors for B frames.Macroblocks within P frames may be individually encoded using eitherintra-frame or inter-frame (predicted) coding. Macroblocks within Bframes may be individually encoded using intra-frame coding, forwardpredicted coding, backward predicted coding, or both forward andbackward (i.e., bi-directionally interpolated) predicted coding. Aslightly different but similar structure is used in MPEG-4 video coding.

After coding, an MPEG data bitstream comprises a sequence of I, P, and Bframes. A sequence may consist of almost any pattern of I, P, and Bframes (there are a few minor semantic restrictions on their placement).However, it is common in industrial practice to have a fixed pattern(e.g., IBBPBBPBBPBBPBB).

MPEG Color Space Representation

MPEG-1, MPEG-2, and MPEG-4 all utilize a Y, U, V color space forcompression. There is a choice of luminance equation, but a typicalconversion transformation between RGB (red-green-blue) to a YUVrepresentation is expressed as:Y=0.59G+0.29R+0.12BU=R−YV=B−YThe Y luminance factors for green range from 0.55 up to 0.75, dependingupon the color system. The factors for red range from 0.2 to 0.3, andthe factors for blue range from 0.05 to 0.15.

This transformation can be cast as a matrix transformation, which is alinear operator intended for use on linear signals. However, this simpletransformation is performed in MPEG 1, 2, and 4 in the non-linear videospace, yielding various artifacts and problems.

It is typical in MPEG to reduce the resolution of the U and V chromachannels to achieve higher compression. The most commonly used reductionof resolution is to use half resolution both vertically andhorizontally. MPEG-2 supports full resolution chroma, as well as halfresolution horizontally. However, the most commonly used MPEG-2profiles, Main Profile at Main Level (MP @ ML) and Main Profile at HighLevel (MP @ HL), use half resolution horizontally and vertically. MPEG-4versions 1 and 2 use half resolution vertically and horizontally. Notethat full chroma resolution is often called 4:4:4, half chromahorizontal resolution is often called 4:2:2, and half vertical andhorizontal resolution is often called 4:2:0. (It should be noted thatthe 4:x:x nomenclature is flawed in its meaning and derivation, but itis common practice to use it to describe the chroma resolutionrelationship to luminance.)

The filter which reduces the horizontal and vertical chroma resolutionunder the various MPEG standards is applied to non-linear video signalsas transformed into the U and V color representation. When the inversetransformation is applied to recover RGB, the non-linear signals and thefilters interact in such a way as to produce artifacts and problems.These problems can be generalized as “crosstalk” between the Y luminanceand the U and V chroma channels, along with spatial aliasing.

Further information on linear versus non-linear representations andtransformations may be found in “The Use of Logarithmic and DensityUnits for Pixels” by Gary Demos, presented at the October 1990 SMPTEconference, and published in the SMPTE Journal (October 1991, vol. 100,no. 10). See also “An Example Representation for Image Color and DynamicRange which is Scalable, Interoperable, and Extensible” by Gary Demos,presented at the October 1993 SMPTE conference and published in theproceedings and preprints. These papers describe the benefits oflogarithmic and linear spaces at various stages of the image compressionprocessing pipeline, and are hereby incorporated by reference.

Chroma Sub-Sampling

The reason for reducing chroma resolution for U and V is that the humanvisual system is less sensitive to changes in U and V than it is tochanges in luminance, Y. Since Y is mostly green, and U and V are mostlyred, and blue respectively, this can also be described as a human visualsensitivity being higher for green than for red and blue. However,although U and V are treated the same in MPEG-1, MPEG-2, and MPEG-4, thehuman visual system is more sensitive to U (with its red component) thanto V (with its blue component).

This difference in chroma sensitivity is embodied in the 1951 NTSC-2color standard that is used for television. NTSC-2 uses a YIQ colorspace, where I and Q are similar to U and V (with slightly differentweightings). That is, the I channel primarily represents red minusluminance and the Q channel primarily represents blue minus luminance.In NTSC-2, the luminance is given 4.5 MHz of analog bandwidth, and the Ichroma channel is given 1.5 MHz of analog bandwidth. The Q channel,representing the blue-yellow axis, is given only 0.5 MHz of analogbandwidth.

Thus, the NTSC-2 television system allocates three times as muchinformation to the I channel than it does to the Q channel, and threetimes as much information to the Y luminance channel than to the Ichannel. Therefore, the bandwidth ratio between the Y luminance channeland the Q (blue minus luminance) channel is nine. These MPEG YUV andNTSC-2 relationships are summarized in the following table:

Ratio YUV 4:4:4 YUV 4:2:2 YUV 4:2:0 NTSC-2 Red, U, and I 1:1 2:1 4:1 3:1pixels to Y Blue, V, and Q 1:1 2:1 4:1 9:1 pixels to Y

Ratio of Chroma Resolution to Luminance

Clearly there is a greater difference in treatment between the luminancechannel and the U and V channels under the MPEG standards than theluminance and I and Q channels in the NTSC-2 standard.

SUMMARY

The invention is directed to methods, systems, and computer programs forimproving compressed image chroma information.

More particularly, in one aspect of the invention, a color video imagemay be improved by increasing the red resolution for an RGBrepresentation (or the U resolution for a YUV representation) above theresolution used for blue (or V). Using lower resolution for the bluecolor component means less information needs to be compressed, such asin a motion compensated color video image compression system. Thisaspect of the invention includes a method, system, and computer programfor compressing image chroma information of a color video image in avideo image compression system by selecting a resolution for a red colorcomponent of the color video image that is higher than the resolutionfor a blue color component of the color video image.

Another aspect of the invention is a technique for reducing the level ofchroma noise that results from any given value of the quantizationparameter (QP) used during compression, thereby improving image quality.This is accomplished by utilizing a lower value of QP for the U (=R−Y)channel than for the Y channel. Similarly, the quality of the V (=B−Y)channel may also be improved by utilizing a lower QP value for the Vchannel than for the Y channel.

Another aspect of the invention is a technique useful when highercompression is required. In this aspect, a positive QP bias is appliedto the QP value for the Y channel for use with either or both of the Uand V chroma channels.

Another aspect of the invention is use of a logarithmic representationto benefit image coding. Logarithmic coding, when feasible, can improvecoding efficiency for YUV color space representations of imagesoriginally represented as linear RGB pixel values. At other processingsteps, a conversion to and from linear representations can bebeneficial.

Another aspect of the invention is a method for improving the videocharacteristics of a color video image in a video compression system,including: selecting a set of image channels to represent the colorvideo image, including a luminance channel and n chroma channels, wheren is at least three; and compressing the luminance channel and the nadditional chroma channels to a compressed video image.

The details of one or more embodiments of the invention are set forth inthe accompanying drawings and the description below. Other features,objects, and advantages of the invention will be apparent from thedescription and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a flowchart showing an illustrative method (which may becomputer implemented) for increasing the resolution for U above theresolution used for V in a YUV color space representation.

FIG. 2 is a flowchart showing an illustrative method (which may becomputer implemented) for applying a QP bias for chroma channels.

FIG. 3 is a flowchart showing an illustrative method (which may becomputer implemented) for logarithmic coding of luminance and chromainformation.

FIG. 4 is a flowchart showing an illustrative method (which may becomputer implemented) for coding additional chroma channels in an imagecompression system.

Like reference symbols in the various drawings indicate like elements.

DETAILED DESCRIPTION

Improved Color Coding Precision

As the quality of images improves with respect to the attributes ofreduced noise, extended dynamic range, and extended color range, humansensitivity to color also increases. In particular, it has been observedthat red in an RGB representation (or U in a YUV representation) oftenrequires higher precision and clarity than is commonly used in videocompression.

Unless blue is being used for processing (such as blue-screen specialeffects compositing or image analysis), human sensitivity to theblue-yellow chroma axis, as embodied by either blue or V, is adequatelyaddressed by half resolution sampling horizontally and vertically. Thus,one quarter of the total number of pixels of an image providessufficient quality for representing the blue or V chroma axis. However,unlike blue and V, one-half resolution coding of red and/or U issometimes insufficient in quality with respect to large wide-dynamicrange displays and projectors.

Thus, an image may be improved by increasing the red resolution for anRGB representation (or the U resolution for a YUV representation) abovethe resolution used for blue (or V). Using lower resolution for the bluecolor component means less information needs to be compressed, such asin a motion compensated color video image compression system.

In accordance with the invention, there are three preferred methods ofmaintaining increased red (or U) resolution with respect to adownfiltered blue (or V) resolution:

1) Use full resolution for red and/or U;

2) Use one-half resolution on only one chroma axis, either vertically orhorizontally, for red and/or U; or

3) Use a filtered resolution between full size and one-half, such as ⅔or ¾, on one or both chroma axes for red and/or U.

FIG. 1 is a flowchart showing an illustrative method (which may becomputer implemented) utilizing higher resolution for U than theresolution used for V in a YUV color space representation (a similarmethod may be applied to an RGB color space representation):

Step 101: In an image compression system utilizing a YUV color spacerepresentation, downsize filter the V (=B−Y) channel of an input imageto one-half resolution horizontally, and optionally to one-halfresolution vertically.

Step 102: Downsize filter the U (=R−Y) channel of the image to aresolution higher than the V (=B−Y) channel, preferably being one of:

a) full resolution;

b) between one-half and full resolution horizontally, but fullresolution vertically;

c) between one-half and full resolution horizontally and vertically;

d) between one-half and full resolution vertically, but full resolutionhorizontally.

Step 103: Compress the YUV image (having luminance Y and the downsizefiltered U and V chroma information) using an MPEG-like compressionsystem.

Step 104: Decompress the images into Y, U, and V channels (usually in adifferent computer).

Step 105: Convert the U and V channels to full resolution, using theappropriate resolution increase (i.e., the reciprocal of the downsizefilter factor used in Step 101 above for V and Step 102 above for U).

Step 106: Optionally, convert the YUV picture to an RGB image forviewing, analysis, or further processing.

Differential QP Bias for Chroma

Co-pending U.S. patent application Ser. No. 09/798,346, entitled “HighPrecision Encoding and Decoding of Video Images” and assigned to theassignee of the present invention (which is hereby incorporated byreference), teaches various aspects of the use of the quantizationparameter (QP) during compression. Another aspect of the presentinvention is a technique for reducing the level of chroma noise thatresults from any given value of the quantization parameter (QP) usedduring compression, thereby improving image quality. This isaccomplished by utilizing a lower value of QP for the U (=R−Y) channelthan for the Y channel. Similarly, the quality of V (=B−Y) may also beimproved by utilizing a lower QP value for the V channel than for the Ychannel.

A simple method of implementing a reduced chroma QP value is to subtracta constant value from the QP value used for the Y (luminance) channel.Alternatively, a separate constant value (lower than the QP value for Y)might be used for each of U and V. For example, “2” might be subtractedfrom the QP value for Y to yield the QP value for U, and “1” might besubtracted for the QP value for Y to yield the QP value for V. Anyuseful value of the amount to subtract can be used, limited only by aminimum value of “1” for the applied QP value.

This method works for constant QP values (variable bit rate). It alsoworks as well for variable QP values (e.g., in both constant andvariable bit rate motion compensated compression systems), since theinstantaneous QP value can be biased by subtracting a specifieddifference value from the QP value for Y to yield a QP value for each ofU and V.

Further, the range of these differential chroma-biased QP values can beextended using the extended QP range function or lookup, as described inthe “High Precision Encoding and Decoding of Video Images” patentapplication referenced above.

It is necessary to signal the U and V bias values from the encoder tothe decoder unless a pre-arranged value is used. These can be specifiedonce, for example, for each session, group of pictures (GOP), frame, orimage region.

FIG. 2 is a flowchart showing an illustrative method (which may becomputer implemented) for applying a QP bias for chroma channels:

Step 201: In an image compression system, reduce the QP value for eachof the U and V chroma channels by a selected value (which may bedifferent for each channel).

Step 202: Utilize this reduced QP value for the U and V chroma channelcompressions, respectively.

Step 203: Optionally, if variable QP values are used, ensure that thereduced U and V QP value is at least “1”.

Step 204: Unless a pre-set bias is to be used, signal or convey the QPvalue reduction amount to the decoder as often as it may change (once ata minimum).

Step 205: Decompress (usually in a different computer) the signal usingthe appropriate QP value for U and V (again ensuring that the reduced QPvalue is at least “1”).

Step 206: Optionally, view the decompressed images, or use the imagesfor additional processing or analysis.

Another aspect of the invention is a technique useful when highercompression is required. In this aspect, a positive QP bias is appliedto the QP value for the Y channel for use with either or both of the Uand V chroma channels (preferably checking against a QP maximum value ofa compression system, if any). Separate bias can be used for each of theU and V channels. Otherwise, the steps of such an embodiment would besimilar to those shown in FIG. 2.

Logarithmic Coding of Luminance and Chroma

The paper entitled “The Use of Logarithmic and Density Units forPixels,” referenced above, describes the benefits of a logarithmicrepresentation for dynamic range. Log representations of a matchingdynamic range are somewhat similar to commonly used video transferfunctions. Even though similar, the logarithmic representation is moreoptimal in extensibility, calibration usage, and in orthogonality ofcolor channels than are the various commonly used video representations.

Another aspect of the invention is use of a logarithmic representationto benefit image coding. It has been discovered that logarithmic coding,when feasible, can improve coding efficiency for YUV color spacerepresentations of images originally represented as linear RGB pixelvalues (such as at the sensor of a camera). At other processing steps, aconversion to and from linear representations can be beneficial.

As described in the “High Precision Encoding and Decoding of VideoImages” patent application referenced above, chroma crosstalk withluminance is minimized when:Y log=Log(Wr*R+Wg*G+Wb*B)U=Log(R)−Y logV=Log(B)−Y logwhere Wr, Wg, and Wb are the linear weightings for the red, green, andblue components of luminance, and where R, G, and B represent a linearlight space. These relationships are useful in applying this aspect ofthe invention.

FIG. 3 is a flowchart showing an illustrative method (which may becomputer implemented) for logarithmic coding of luminance and chromainformation:

Step 301: In an image compression system, perform the followingtransformation on input (e.g., directly from a video camera) linear R,G, and B pixel values:Y log=Log(Wr*R+Wg*G+Wb*B)U=Log(R)−Y logV=Log(B)−Y logwhere Wr, Wg, and Wb are the linear weightings for the red, green, andblue components of luminance.

Step 302: Optionally, reduce the resolution of the U and V chromachannels (as described above).

Step 303: Perform motion-compensated compression on this Y, U, and Vrepresentation of the moving image.

Step 304: Decompress the compressed images to restore Y, U, and V colorcomponents of the moving image (usually in a different computer).

Step 305: If optional Step 302 was applied, reverse the resolutionreduction to restore full U and V resolution.

Step 306: Restore the linear R, G, and B pixel values using thefollowing transformation:R=anti-log(Y+U)B=anti-log(Y+V)G=(anti-log(Y)−Wr*R−Wb*B)/Wg

Step 307: Optionally, convert to other video RGB representations(alternatively, may be done in lieu of Step 306 rather than in additionto Step 306).

Additional Chroma Axes

In extended dynamic range and extended contrast range images, it may bebeneficial to augment visible wavelength channels with additionalchannels of image information, both visible and non-visible.

The range of colors available from any given set of red, green, and blueprimaries does not include all possible visible colors. The combining ofproportions of red, green, and blue primary colors to create othervisible colors such as yellow, orange, cyan, and brown, is a property ofthe human visual system known as the “metamerism”.

As pointed out in the paper entitled “An Example Representation forImage Color and Dynamic Range which is Scalable, Interoperable, andExtensible”, referenced above, it is possible to add additional colorprimaries to the three primaries of red, green, and blue. In particular,cyan, magenta, and yellow color primaries help to extend the color gamutbeyond the range available from most common red, green, and blue primaryvalues. Further, violet and ultraviolet (which brightens phosphorescentcolors) can also be conveyed.

Beyond the visible colors, invisible infrared wavelengths have provenuseful in penetrating clouds and haze, and in seeing in the dark.Ultraviolet wavelengths can also be useful for seeing low-amplitudevisible image details, such as fingerprints and surface coatings.

Further, even in the visible wavelengths, various materials (e.g., smogand underwater algae) often reduce the amount of contrast or dynamicrange of some wavelengths. This is why smog can appear brown, giving abrown tint to all objects in the distance, having reduced the bluecontrast and dynamic range. This is also why underwater photography canappear green, blue-green, or blue, since the red end of the visiblespectrum is reduced in contrast and dynamic range.

The logarithmic relationships between Y, U, and V, as described above,will optimize the coding of color relationships for visible light.

In this aspect of the invention, additional chroma channels are added tothe channels encoding three primary wavelengths, typically embodied byRGB or YUV representations. Further, when using a YUV color space, it isalso possible to change the makeup of the Y (luminance) channel to favorthe highest amplitude image signals. Thus, for example, the greenvisible channel might be coded using its own chroma channel, withluminance moving to other wavelength regions. This concept can beextended to where Y luminance is infrared, with red, green, and blue(and perhaps other visible and non-visible primaries) each having theirown chroma channels.

In accordance with this aspect of the invention, for each new chromachannel, the following should be determined:

1) Should the channel be coded differentially from one or more otherchannels (usually from luminance, such as U=R−Y)?

2) Should the channel be given full resolution with respect toluminance, or can resolution be reduced without impairing the imagequality for a given intended usage?

The determination in 1) is based upon the correlation of each codedchannel with other channels. For example, ultraviolet or far-infraredwavelength images may be relatively uncorrelated to visible wavelengths,or to each other. In such a case, these channels might be coded withoutreference to other channels. However, any visible wavelengths are highlycorrelated, and thus can almost always benefit from being coded withrespect to each other.

Based upon these determinations, a set of image channels can beselected, usually exceeding (or replacing and exceeding) the threeprimary channels (e.g., YUV). For example, the set of selected imagechannels may comprise a Y′ luminance channel, and n chroma channels,such as a U′ first chroma channel, a V′ second chroma channel, and an X′third chroma channel.

Using this example, and applying motion compensated compression, theselected value of Y′ would be coded with full resolution, and thevarious other chroma channels (U′, V′, X′) would be differentially orindependently coded. All channels can utilize the same motion vector andmacroblock motion compensation structure as would be used forconventional YUV representations, except that there would be additionalchannels. Each such channel would utilize an appropriate resolution withrespect to Y (as determined in step 2 above). In addition, a QP bias (asdescribed above) can be independently applied to each chroma channel, toensure that the desired compression chroma quality is achieved.

Even when applied only to visible wavelengths, additional chromachannels can ensure not only extended color range and more accuratecolor, but also allow additional clarity, detail, and noise fidelity tobe applied to such highly visible colors as magenta, orange, yellow, andaqua-cyan. These benefits can be particularly significant forwide-dynamic range and wide-contrast range images.

FIG. 4 is a flowchart showing an illustrative method (which may becomputer implemented) for coding additional chroma channels in an imagecompression system:

Step 401: In an image compression system, determine an optimal luminancerepresentation for an image, selected based upon widest dynamic rangeand highest resolution, including optional non-visible wavelength imagesignals.

Step 402: Determine n additional chroma channels to represent the image,where n is at least three.

Step 403: Optionally, for each chroma channel, determine whether it isbeneficial to code differentially with respect to luminance and/or oneor more other chroma channels.

Step 404: Determine the resolution desired for each chroma channel imagesignal from an input with respect to the luminance image signal, suchresolution being equal to or less than the resolution of the luminance,and optionally apply a resolution reduction.

Step 405: Compress the Y+n chroma image signals using motion compensatedcompression.

Step 406: Decompress the Y+n chroma images (usually in a differentcomputer).

Step 407: If resolution reduction was applied, restore the originalresolutions of the chroma channels.

Step 408: Combine each chroma channel with its differential counterpart,if any, from Step 403 above.

Step 409: Optionally, perform any of the following:

a) Convert the chroma channels to a viewing space, such as RGB, or tospaces having more than three primaries, and view as a true-color image;

b) Perform the conversion of a) but view as a false-color image (such asmapping infrared to green);

c) Use the chroma channels without conversion for processing and/oranalysis.

As another option, each chroma channel may have a biased QP valueapplied (either increasing or decreasing), relative to the QP value usedfor the luminance channel, to achieve a desired level of quality foreach chroma channel (i.e., trading off chroma noise versus higher degreeof compression).

Implementation

The invention may be implemented in hardware or software, or acombination of both (e.g., programmable logic arrays). Unless otherwisespecified, the algorithms included as part of the invention are notinherently related to any particular computer or other apparatus. Inparticular, various general purpose machines may be used with programswritten in accordance with the teachings herein, or it may be moreconvenient to construct more specialized apparatus (e.g., integratedcircuits) to perform particular functions. Thus, the invention may beimplemented in one or more computer programs executing on one or moreprogrammable computer systems each comprising at least one processor, atleast one data storage system (including volatile and non-volatilememory and/or storage elements), at least one input device or port, andat least one output device or port. Program code is applied to inputdata to perform the functions described herein and generate outputinformation. The output information is applied to one or more outputdevices, in known fashion.

Each such program may be implemented in any desired computer language(including machine, assembly, or high level procedural, logical, orobject oriented programming languages) to communicate with a computersystem. In any case, the language may be a compiled or interpretedlanguage.

Each such computer program is preferably stored on or downloaded to astorage media or device (e.g., solid state memory or media, or magneticor optical media) readable by a general or special purpose programmablecomputer, for configuring and operating the computer when the storagemedia or device is read by the computer system to perform the proceduresdescribed herein. The inventive system may also be considered to beimplemented as a computer-readable storage medium, configured with acomputer program, where the storage medium so configured causes acomputer system to operate in a specific and predefined manner toperform the functions described herein.

A number of embodiments of the invention have been described.Nevertheless, it will be understood that various modifications may bemade without departing from the spirit and scope of the invention. Forexample, some of the steps described above may be order independent, andthus can be performed in an order different from that described.Accordingly, other embodiments are within the scope of the followingclaims.

What is claimed is:
 1. A computer-implemented method for a decoder, themethod comprising: receiving, at the decoder, at least a luminance QP(quantization parameter) value for a macroblock and a first chroma QPbias value for the macroblock, wherein the decoder comprises a luminancechannel, a first chroma channel and a second chroma channel; utilizing,with the decoder, the luminance QP value and the first chroma QP biasvalue to determine a first chroma QP value for the macroblock by addingthe first chroma QP bias value to the luminance QP value; decompressingthe macroblock using the luminance QP value and the first chroma QPvalue, accessing an upsizing resolution factor for at least one channelof the macroblock; and converting the at least one channel to a fullresolution using the upsizing resolution factor; wherein the firstchroma QP value is less than a predetermined maximum value and greaterthan a predetermined minimum value, and wherein the first chroma QPvalue is determined for the first chroma channel.
 2. Thecomputer-implemented method of claim 1, further comprising: receiving,at the decoder, a second chroma QP bias value; utilizing, with thedecoder, the luminance QP value and the second chroma QP bias value todetermine a second chroma QP value by adding the second chroma QP biasvalue to the luminance QP value; and decompressing the image region ofthe video image using at least the second chroma QP value, wherein thesecond chroma QP value is determined for the second chroma channel, andwherein the first chroma QP bias value used to determine the firstchroma QP value for the first chroma channel differs from the secondchroma QP bias value used to determine the second chroma QP value forthe second chroma channel.
 3. The computer-implemented method of claim2, further comprising configuring the first chroma QP bias value to behigher than zero or less than zero, and configuring the second chroma QPbias value to be greater than zero or less than zero.
 4. Thecomputer-implemented method of claim 1, further comprising configuringthe QP bias value to be greater than zero or less than zero.
 5. Thecomputer-implemented method of claim 1, wherein the image region isinter-frame predicted.
 6. The computer-implemented method of claim 1,further comprising: utilizing, with the decoder, a range of differentialchroma-biased QP values, wherein the range of the differentialchroma-biased QP values comprises the QP bias value; and extending therange of the differential chroma-biased QP values with an extended QPrange function or a lookup table comprising the differentialchroma-biased QP values.